graft light fast increment featur select structur learn markov random field jun zhu ni lao eric xing featur select import task order achiev generaliz high dimension learn structur learn markov random field mrf automat discov inher structur underli complex data problem cast solv norm regular paramet estim problem exist graft method avoid infer dens graph structur learn increment select featur graft perform greedi step optim free paramet featur includ greedi strategi result low effici paramet learn trivial mrf paramet learn depend expens subroutin calcul gradient complex calcul gradient mrf typic exponenti size maxim cliqu paper present fast algorithm call graft light solv norm regular maximum likelihood estim mrf effici featur select structur learn graft light iter perform step orthant wise gradient descent free paramet select featur lazi strategi guarante converg global optimum effect select signific featur synthet real data set show graft light effici graft featur select structur learn perform compar optim batch method directli optim featur featur select effici accur structur learn mrf 